Fast and Accurate Parametric Curve Length Computation
نویسندگان
چکیده
This paper describes a simple technique for evaluating the length of a parametric curve. The technique approximates sections of the curve to the arc of a circle using only sample points on the curve: no computation of derivatives or other properties is required. This method is almost as quick to implement and compute as chord-length summation but is much more accurate : it also provides recursion criteria for adaptive sampling. At the end of paper, we discuss briefly the way the algorithm extends to estimate the area of a parametric surface. Introduction The simplest, quickest, and perhaps most widely used technique for determining the length of a parametric curve is chord-length summation (1). Other standard approaches include recursive summation such as the DeCastlejeu algorithm for Bézier curves (2), or integrating the arc length function either by some quadrature technique or by recasting the problem in the form of integrating a differential equation using a technique such as 4th-order Runge-Kutta. This paper presents a new technique that has the following properties: easy to implement. cheap to compute. good worst-case accuracy characteristics. applies to any parametric curve. requires only evaluation of points on the curve. The technique can be summarized as follows: Given points precomputed along the curve Approximate successive triples of points by circular arcs, the lengths of which can be computed cheaply For the basic algorithm, sum the length of non-overlapping arcs; alternatively, sum overlapping arcs to get a second length estimate Regions of high curvature can readily be detected and the algorithm made recursive as necessary. Test results show that the accuracy of the method increases as the 4th power of the number of points evaluated: so doubling the work will result in a 16-fold reduction in the error. Typically this means that evaluating 50 points along the curve will result in an error of a few parts in 108, representing an improvement of 3 orders of magnitude over that obtained by chord-length summation of distances between the same sample points along the curve. Estimation of arc length Consider three points along a curve : P0, P1, and P2. A circle with radius r and center C can be fitted to these points. Let D1 be the distance from P0 to P2, and D2 be the sum of the distances from P0 to P1 and from P1 to P2. P0
منابع مشابه
Wind Turbine Power Curve Modeling Using Parametric Approach
Abstract: In recent years, due to the limitation of fossil fuels and the environmental Impact of using these fuels, focusing on renewable energy sources has increased significantly. In developed countries, using clean energy such as wind power has been considered as an alternative source. Monitoring the performance of wind turbines and controlling their output power quality is one of the import...
متن کاملApproximate Arc Length Parametrization
Current approaches to compute the arc length of a parametric curve rely on table lookup schemes. We present an approximate closed-form solution to the problem of computing an arc length parametrization for any given parametric curve. Our solution outputs a one or two-span Bézier curve which relates the length of the curve to the parametric variable. The main advantage of our approach is that we...
متن کاملRegular spatial B-spline active contour for fast video segmentation
This paper deals with fast video segmentation using active contours. Region-based active contours is a powerful technique for video segmentation. However most of these methods are implemented using level-sets. Although level-set methods provide accurate segmentation, they suffer from large computational cost. The proposed method uses BSpline parametric method to highly improve the computation c...
متن کاملEfficient and Accurate Higher-order Fast Multipole Boundary Element Method for Poisson Boltzmann Electrostatics
The Poisson-Boltzmann equation is a partial differential equation that describes the electrostatic behavior of molecules in ionic solutions. Significant efforts have been devoted to accurate and efficient computation for solving this equation. In this paper, we developed a boundary element framework based on the linear time fast multipole method for solving the linearized PoissonBoltzmann equat...
متن کاملTopological Neighborhoods for Spline Curves: Practice & Theory
The unresolved subtleties of floating point computations in geometric modeling become considerably more difficult in animations and scientific visualizations. Some emerging solutions based upon topological considerations will be presented. A novel geometric seeding algorithm for Newton’s method was used in experiments to determine feasible support for these visualization applications. 1 Computi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graphics, GPU, & Game Tools
دوره 6 شماره
صفحات -
تاریخ انتشار 2001